Some binary BCH codes with length $n=2^m+1$
نویسندگان
چکیده
Under research for near sixty years, Bose-Ray-Chaudhuri-Hocquenghem(BCH) codes have played increasingly important roles in many applications such as communication systems, data storage and information security. However, the dimension and minimum distance of BCH codes are seldom solved until now because of their intractable characteristics. The objective of this paper is to study the dimensions of some BCH codes of length n = 2 + 1 with m = 2t+1, 4t+2, 8t+4 and m ≥ 10. Some new techniques are employed to investigate coset leaders modulo n. For each type of m above, the first five largest coset leaders modulo n are determined, the dimension of some BCH codes of length n with designed distance δ > 2 m 2 ⌉ is presented. These new techniques and results may be helpful to study other families of cyclic codes over finite fields.
منابع مشابه
Idempotent and Bch Bound
Using the characterization of the idempotents of a narrow-sense primitive binary BCH code, we are able to give classes of such codes whose minimum distance reaches the BCH bound. Let be a primitive element of GF(2 m). We denote R n = GF(2))x]=(x n ? 1), n = 2 m ? 1. 1 Binary BCH codes and locator polynomials 1.1 Primitive binary BCH codes For our purpose we only need to deene a particular class...
متن کاملMaximum-likelihood soft decision decoding of BCH codes
The problem of efficient maximum-likelihood soft decision decoding of binary BCH codes is considered. It is known that those primitive BCH codes whose designed distance is one less than a power of two, contain subcodes of high dimension which consist of a direct sum of several identical codes. We show that the same kind of direct-sum structure exists in all the primitive BCH codes. as well as i...
متن کاملStudying the locator polynomials of minimum weight codewords of BCH codes
We consider only primitive binary cyclic codes of length n = 2 m ? 1. A BCH-code with designed distance is denoted B(n;). A BCH-code is always a narrow-sense BCH-code. A codeword is identiied with its locator polynomial, whose coeecients are the symmetric functions of the locators. The deenition of the code by its zeros-set involves some properties for the power sums of the locators. Moreover t...
متن کاملThe minimum distance of some binary codes via the Newton's identities
In this paper, we give a natural way of deciding whether a given cyclic code contains a word of given weight. The method is based on the manipulation of the locators and of the locator polynomial of a codeword x. Because of the dimensions of the problem, we need to use a symbolic computation software, like Maple or Scratchpad II. The method can be ineeective when the length is too large. The pa...
متن کاملA new asymptotically optimal code for the positive integers
A method of constructing binary linear codes is presentedthat have a minimum Hamming distance of five. Some efficient newcodes are obtained. In particular, a (47,36,5) code is obtained that hassix more information bits than the best previously known code with 11check bits.In Section II, we propose a general formulation of paritycheck matrix for the desired code. We then ...
متن کامل